TSTP Solution File: SEV091^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV091^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n027.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 09:41:18 EDT 2024
% Result : Theorem 0.22s 0.41s
% Output : Refutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEV091^5 : TPTP v8.1.2. Released v4.0.0.
% 0.16/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.16/0.36 % Computer : n027.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Fri May 3 12:18:21 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.37 This is a TH0_THM_NEQ_NAR problem
% 0.22/0.37 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.cAWZJGONAf/Vampire---4.8_8036
% 0.22/0.39 % (8227)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.22/0.39 % (8227)Instruction limit reached!
% 0.22/0.39 % (8227)------------------------------
% 0.22/0.39 % (8227)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.39 % (8227)Termination reason: Unknown
% 0.22/0.39 % (8227)Termination phase: Saturation
% 0.22/0.39
% 0.22/0.39 % (8227)Memory used [KB]: 5500
% 0.22/0.39 % (8227)Time elapsed: 0.003 s
% 0.22/0.39 % (8227)Instructions burned: 2 (million)
% 0.22/0.39 % (8227)------------------------------
% 0.22/0.39 % (8227)------------------------------
% 0.22/0.39 % (8226)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (2999ds/27Mi)
% 0.22/0.40 % (8228)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.22/0.40 % (8231)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (2999ds/3Mi)
% 0.22/0.40 % (8230)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (2999ds/18Mi)
% 0.22/0.40 % (8228)Instruction limit reached!
% 0.22/0.40 % (8228)------------------------------
% 0.22/0.40 % (8228)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.40 % (8229)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (2999ds/275Mi)
% 0.22/0.40 % (8228)Termination reason: Unknown
% 0.22/0.40 % (8228)Termination phase: Property scanning
% 0.22/0.40
% 0.22/0.40 % (8228)Memory used [KB]: 895
% 0.22/0.40 % (8228)Time elapsed: 0.003 s
% 0.22/0.40 % (8228)Instructions burned: 2 (million)
% 0.22/0.40 % (8228)------------------------------
% 0.22/0.40 % (8228)------------------------------
% 0.22/0.40 % (8225)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (2999ds/4Mi)
% 0.22/0.40 % (8231)Instruction limit reached!
% 0.22/0.40 % (8231)------------------------------
% 0.22/0.40 % (8231)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.40 % (8231)Termination reason: Unknown
% 0.22/0.40 % (8231)Termination phase: Saturation
% 0.22/0.40
% 0.22/0.40 % (8231)Memory used [KB]: 5500
% 0.22/0.40 % (8231)Time elapsed: 0.004 s
% 0.22/0.40 % (8231)Instructions burned: 3 (million)
% 0.22/0.40 % (8231)------------------------------
% 0.22/0.40 % (8231)------------------------------
% 0.22/0.40 % (8223)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (2999ds/183Mi)
% 0.22/0.40 % (8230)First to succeed.
% 0.22/0.41 % (8230)Refutation found. Thanks to Tanya!
% 0.22/0.41 % SZS status Theorem for Vampire---4
% 0.22/0.41 % SZS output start Proof for Vampire---4
% 0.22/0.41 thf(func_def_0, type, cQ: $i > $i > $o).
% 0.22/0.41 thf(func_def_1, type, cP: $i > $i > $o).
% 0.22/0.41 thf(f79,plain,(
% 0.22/0.41 $false),
% 0.22/0.41 inference(trivial_inequality_removal,[],[f78])).
% 0.22/0.41 thf(f78,plain,(
% 0.22/0.41 ($true != $true)),
% 0.22/0.41 inference(superposition,[],[f15,f75])).
% 0.22/0.41 thf(f75,plain,(
% 0.22/0.41 ( ! [X0 : $i,X1 : $i] : (((cQ @ X0 @ X1) = $true)) )),
% 0.22/0.41 inference(subsumption_resolution,[],[f73,f66])).
% 0.22/0.41 thf(f66,plain,(
% 0.22/0.41 ( ! [X0 : $i] : (((cQ @ sK3 @ X0) = $true)) )),
% 0.22/0.41 inference(trivial_inequality_removal,[],[f65])).
% 0.22/0.41 thf(f65,plain,(
% 0.22/0.41 ( ! [X0 : $i] : (($true != $true) | ((cQ @ sK3 @ X0) = $true)) )),
% 0.22/0.41 inference(backward_demodulation,[],[f27,f62])).
% 0.22/0.41 thf(f62,plain,(
% 0.22/0.41 ( ! [X0 : $i] : (($true = (cQ @ sK2 @ X0))) )),
% 0.22/0.41 inference(trivial_inequality_removal,[],[f58])).
% 0.22/0.41 thf(f58,plain,(
% 0.22/0.41 ( ! [X0 : $i] : (($true = (cQ @ sK2 @ X0)) | ($true != $true)) )),
% 0.22/0.41 inference(superposition,[],[f13,f56])).
% 0.22/0.41 thf(f56,plain,(
% 0.22/0.41 ( ! [X0 : $i] : (((cQ @ X0 @ sK2) = $true)) )),
% 0.22/0.41 inference(subsumption_resolution,[],[f55,f13])).
% 0.22/0.41 thf(f55,plain,(
% 0.22/0.41 ( ! [X0 : $i] : (($true = (cQ @ sK2 @ X0)) | ((cQ @ X0 @ sK2) = $true)) )),
% 0.22/0.41 inference(trivial_inequality_removal,[],[f50])).
% 0.22/0.41 thf(f50,plain,(
% 0.22/0.41 ( ! [X0 : $i] : (($true = (cQ @ sK2 @ X0)) | ((cQ @ X0 @ sK2) = $true) | ($true != $true)) )),
% 0.22/0.41 inference(superposition,[],[f26,f49])).
% 0.22/0.41 thf(f49,plain,(
% 0.22/0.41 ( ! [X0 : $i] : (((cQ @ sK3 @ X0) = $true) | ((cQ @ X0 @ sK2) = $true)) )),
% 0.22/0.41 inference(trivial_inequality_removal,[],[f44])).
% 0.22/0.41 thf(f44,plain,(
% 0.22/0.41 ( ! [X0 : $i] : (($true != $true) | ((cQ @ X0 @ sK2) = $true) | ((cQ @ sK3 @ X0) = $true)) )),
% 0.22/0.41 inference(superposition,[],[f12,f43])).
% 0.22/0.41 thf(f43,plain,(
% 0.22/0.41 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true = (cP @ X2 @ X1)) | ((cQ @ X0 @ X1) = $true) | ((cQ @ X2 @ X0) = $true)) )),
% 0.22/0.41 inference(trivial_inequality_removal,[],[f42])).
% 0.22/0.41 thf(f42,plain,(
% 0.22/0.41 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((cQ @ X0 @ X1) = $true) | ($true != $true) | ($true = (cP @ X2 @ X1)) | ((cQ @ X2 @ X0) = $true)) )),
% 0.22/0.41 inference(superposition,[],[f41,f16])).
% 0.22/0.41 thf(f16,plain,(
% 0.22/0.41 ( ! [X3 : $i,X4 : $i] : (($true = (cP @ X3 @ X4)) | ($true = (cQ @ X3 @ X4))) )),
% 0.22/0.41 inference(cnf_transformation,[],[f11])).
% 0.22/0.41 thf(f11,plain,(
% 0.22/0.41 ! [X0,X1,X2] : (((cP @ X1 @ X2) = $true) | ((cP @ X1 @ X0) != $true) | ((cP @ X0 @ X2) != $true)) & ! [X3,X4] : (($true = (cQ @ X3 @ X4)) | ($true = (cP @ X3 @ X4))) & ((cQ @ sK1 @ sK0) != $true) & ! [X7,X8,X9] : (((cQ @ X8 @ X7) != $true) | ((cQ @ X9 @ X7) = $true) | ((cQ @ X9 @ X8) != $true)) & ! [X10,X11] : (((cQ @ X11 @ X10) = $true) | ((cQ @ X10 @ X11) != $true)) & ((cP @ sK3 @ sK2) != $true)),
% 0.22/0.41 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f8,f10,f9])).
% 0.22/0.41 thf(f9,plain,(
% 0.22/0.41 ? [X5,X6] : ($true != (cQ @ X6 @ X5)) => ((cQ @ sK1 @ sK0) != $true)),
% 0.22/0.41 introduced(choice_axiom,[])).
% 0.22/0.41 thf(f10,plain,(
% 0.22/0.41 ? [X12,X13] : ($true != (cP @ X13 @ X12)) => ((cP @ sK3 @ sK2) != $true)),
% 0.22/0.41 introduced(choice_axiom,[])).
% 0.22/0.41 thf(f8,plain,(
% 0.22/0.41 ! [X0,X1,X2] : (((cP @ X1 @ X2) = $true) | ((cP @ X1 @ X0) != $true) | ((cP @ X0 @ X2) != $true)) & ! [X3,X4] : (($true = (cQ @ X3 @ X4)) | ($true = (cP @ X3 @ X4))) & ? [X5,X6] : ($true != (cQ @ X6 @ X5)) & ! [X7,X8,X9] : (((cQ @ X8 @ X7) != $true) | ((cQ @ X9 @ X7) = $true) | ((cQ @ X9 @ X8) != $true)) & ! [X10,X11] : (((cQ @ X11 @ X10) = $true) | ((cQ @ X10 @ X11) != $true)) & ? [X12,X13] : ($true != (cP @ X13 @ X12))),
% 0.22/0.41 inference(rectify,[],[f7])).
% 0.22/0.41 thf(f7,plain,(
% 0.22/0.41 ! [X7,X5,X6] : (($true = (cP @ X5 @ X6)) | ($true != (cP @ X5 @ X7)) | ($true != (cP @ X7 @ X6))) & ! [X0,X1] : (((cQ @ X0 @ X1) = $true) | ((cP @ X0 @ X1) = $true)) & ? [X11,X10] : ((cQ @ X10 @ X11) != $true) & ! [X4,X2,X3] : (((cQ @ X2 @ X4) != $true) | ($true = (cQ @ X3 @ X4)) | ($true != (cQ @ X3 @ X2))) & ! [X9,X8] : (((cQ @ X8 @ X9) = $true) | ((cQ @ X9 @ X8) != $true)) & ? [X13,X12] : ((cP @ X12 @ X13) != $true)),
% 0.22/0.41 inference(flattening,[],[f6])).
% 0.22/0.41 thf(f6,plain,(
% 0.22/0.41 (? [X11,X10] : ((cQ @ X10 @ X11) != $true) & ? [X13,X12] : ((cP @ X12 @ X13) != $true)) & (! [X7,X6,X5] : (($true = (cP @ X5 @ X6)) | (($true != (cP @ X7 @ X6)) | ($true != (cP @ X5 @ X7)))) & ! [X0,X1] : (((cQ @ X0 @ X1) = $true) | ((cP @ X0 @ X1) = $true)) & ! [X4,X3,X2] : (($true = (cQ @ X3 @ X4)) | (($true != (cQ @ X3 @ X2)) | ((cQ @ X2 @ X4) != $true))) & ! [X9,X8] : (((cQ @ X8 @ X9) = $true) | ((cQ @ X9 @ X8) != $true)))),
% 0.22/0.41 inference(ennf_transformation,[],[f5])).
% 0.22/0.41 thf(f5,plain,(
% 0.22/0.41 ~((! [X7,X6,X5] : ((($true = (cP @ X7 @ X6)) & ($true = (cP @ X5 @ X7))) => ($true = (cP @ X5 @ X6))) & ! [X0,X1] : (((cQ @ X0 @ X1) = $true) | ((cP @ X0 @ X1) = $true)) & ! [X4,X3,X2] : ((($true = (cQ @ X3 @ X2)) & ((cQ @ X2 @ X4) = $true)) => ($true = (cQ @ X3 @ X4))) & ! [X8,X9] : (((cQ @ X9 @ X8) = $true) => ((cQ @ X8 @ X9) = $true))) => (! [X11,X10] : ((cQ @ X10 @ X11) = $true) | ! [X13,X12] : ((cP @ X12 @ X13) = $true)))),
% 0.22/0.41 inference(fool_elimination,[],[f4])).
% 0.22/0.41 thf(f4,plain,(
% 0.22/0.41 ~((! [X0,X1] : ((cP @ X0 @ X1) | (cQ @ X0 @ X1)) & ! [X2,X3,X4] : (((cQ @ X3 @ X2) & (cQ @ X2 @ X4)) => (cQ @ X3 @ X4)) & ! [X5,X6,X7] : (((cP @ X5 @ X7) & (cP @ X7 @ X6)) => (cP @ X5 @ X6)) & ! [X8,X9] : ((cQ @ X9 @ X8) => (cQ @ X8 @ X9))) => (! [X10,X11] : (cQ @ X10 @ X11) | ! [X12,X13] : (cP @ X12 @ X13)))),
% 0.22/0.41 inference(rectify,[],[f2])).
% 0.22/0.41 thf(f2,negated_conjecture,(
% 0.22/0.41 ~((! [X0,X1] : ((cP @ X0 @ X1) | (cQ @ X0 @ X1)) & ! [X1,X0,X2] : (((cQ @ X0 @ X1) & (cQ @ X1 @ X2)) => (cQ @ X0 @ X2)) & ! [X0,X2,X1] : (((cP @ X0 @ X1) & (cP @ X1 @ X2)) => (cP @ X0 @ X2)) & ! [X1,X0] : ((cQ @ X0 @ X1) => (cQ @ X1 @ X0))) => (! [X0,X1] : (cQ @ X0 @ X1) | ! [X0,X1] : (cP @ X0 @ X1)))),
% 0.22/0.41 inference(negated_conjecture,[],[f1])).
% 0.22/0.41 thf(f1,conjecture,(
% 0.22/0.41 (! [X0,X1] : ((cP @ X0 @ X1) | (cQ @ X0 @ X1)) & ! [X1,X0,X2] : (((cQ @ X0 @ X1) & (cQ @ X1 @ X2)) => (cQ @ X0 @ X2)) & ! [X0,X2,X1] : (((cP @ X0 @ X1) & (cP @ X1 @ X2)) => (cP @ X0 @ X2)) & ! [X1,X0] : ((cQ @ X0 @ X1) => (cQ @ X1 @ X0))) => (! [X0,X1] : (cQ @ X0 @ X1) | ! [X0,X1] : (cP @ X0 @ X1))),
% 0.22/0.41 file('/export/starexec/sandbox2/tmp/tmp.cAWZJGONAf/Vampire---4.8_8036',cCADE13_pme)).
% 0.22/0.41 thf(f41,plain,(
% 0.22/0.41 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((cP @ X1 @ X2) != $true) | ((cP @ X0 @ X2) = $true) | ((cQ @ X0 @ X1) = $true)) )),
% 0.22/0.41 inference(trivial_inequality_removal,[],[f40])).
% 0.22/0.41 thf(f40,plain,(
% 0.22/0.41 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((cQ @ X0 @ X1) = $true) | ((cP @ X0 @ X2) = $true) | ((cP @ X1 @ X2) != $true) | ($true != $true)) )),
% 0.22/0.41 inference(superposition,[],[f17,f16])).
% 0.22/0.41 thf(f17,plain,(
% 0.22/0.41 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((cP @ X1 @ X0) != $true) | ((cP @ X1 @ X2) = $true) | ((cP @ X0 @ X2) != $true)) )),
% 0.22/0.41 inference(cnf_transformation,[],[f11])).
% 0.22/0.41 thf(f12,plain,(
% 0.22/0.41 ((cP @ sK3 @ sK2) != $true)),
% 0.22/0.41 inference(cnf_transformation,[],[f11])).
% 0.22/0.41 thf(f26,plain,(
% 0.22/0.41 ( ! [X0 : $i] : (((cQ @ sK3 @ X0) != $true) | ($true = (cQ @ sK2 @ X0))) )),
% 0.22/0.41 inference(trivial_inequality_removal,[],[f25])).
% 0.22/0.41 thf(f25,plain,(
% 0.22/0.41 ( ! [X0 : $i] : (($true != $true) | ((cQ @ sK3 @ X0) != $true) | ($true = (cQ @ sK2 @ X0))) )),
% 0.22/0.41 inference(superposition,[],[f14,f21])).
% 0.22/0.41 thf(f21,plain,(
% 0.22/0.41 ($true = (cQ @ sK2 @ sK3))),
% 0.22/0.41 inference(trivial_inequality_removal,[],[f20])).
% 0.22/0.41 thf(f20,plain,(
% 0.22/0.41 ($true != $true) | ($true = (cQ @ sK2 @ sK3))),
% 0.22/0.41 inference(superposition,[],[f13,f19])).
% 0.22/0.41 thf(f19,plain,(
% 0.22/0.41 ((cQ @ sK3 @ sK2) = $true)),
% 0.22/0.41 inference(trivial_inequality_removal,[],[f18])).
% 0.22/0.41 thf(f18,plain,(
% 0.22/0.41 ($true != $true) | ((cQ @ sK3 @ sK2) = $true)),
% 0.22/0.41 inference(superposition,[],[f12,f16])).
% 0.22/0.41 thf(f14,plain,(
% 0.22/0.41 ( ! [X8 : $i,X9 : $i,X7 : $i] : (((cQ @ X9 @ X8) != $true) | ((cQ @ X9 @ X7) = $true) | ((cQ @ X8 @ X7) != $true)) )),
% 0.22/0.41 inference(cnf_transformation,[],[f11])).
% 0.22/0.41 thf(f13,plain,(
% 0.22/0.41 ( ! [X10 : $i,X11 : $i] : (((cQ @ X10 @ X11) != $true) | ((cQ @ X11 @ X10) = $true)) )),
% 0.22/0.41 inference(cnf_transformation,[],[f11])).
% 0.22/0.41 thf(f27,plain,(
% 0.22/0.41 ( ! [X0 : $i] : (($true != (cQ @ sK2 @ X0)) | ((cQ @ sK3 @ X0) = $true)) )),
% 0.22/0.41 inference(trivial_inequality_removal,[],[f24])).
% 0.22/0.41 thf(f24,plain,(
% 0.22/0.41 ( ! [X0 : $i] : (($true != (cQ @ sK2 @ X0)) | ($true != $true) | ((cQ @ sK3 @ X0) = $true)) )),
% 0.22/0.41 inference(superposition,[],[f14,f19])).
% 0.22/0.41 thf(f73,plain,(
% 0.22/0.41 ( ! [X0 : $i,X1 : $i] : (($true != (cQ @ sK3 @ X1)) | ((cQ @ X0 @ X1) = $true)) )),
% 0.22/0.41 inference(trivial_inequality_removal,[],[f71])).
% 0.22/0.41 thf(f71,plain,(
% 0.22/0.41 ( ! [X0 : $i,X1 : $i] : (((cQ @ X0 @ X1) = $true) | ($true != $true) | ($true != (cQ @ sK3 @ X1))) )),
% 0.22/0.41 inference(superposition,[],[f14,f69])).
% 0.22/0.41 thf(f69,plain,(
% 0.22/0.41 ( ! [X0 : $i] : (($true = (cQ @ X0 @ sK3))) )),
% 0.22/0.41 inference(trivial_inequality_removal,[],[f68])).
% 0.22/0.41 thf(f68,plain,(
% 0.22/0.41 ( ! [X0 : $i] : (($true = (cQ @ X0 @ sK3)) | ($true != $true)) )),
% 0.22/0.41 inference(superposition,[],[f13,f66])).
% 0.22/0.41 thf(f15,plain,(
% 0.22/0.41 ((cQ @ sK1 @ sK0) != $true)),
% 0.22/0.41 inference(cnf_transformation,[],[f11])).
% 0.22/0.41 % SZS output end Proof for Vampire---4
% 0.22/0.41 % (8230)------------------------------
% 0.22/0.41 % (8230)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.41 % (8230)Termination reason: Refutation
% 0.22/0.41
% 0.22/0.41 % (8230)Memory used [KB]: 5500
% 0.22/0.41 % (8230)Time elapsed: 0.011 s
% 0.22/0.41 % (8230)Instructions burned: 12 (million)
% 0.22/0.41 % (8230)------------------------------
% 0.22/0.41 % (8230)------------------------------
% 0.22/0.41 % (8221)Success in time 0.02 s
% 0.22/0.41 % Vampire---4.8 exiting
%------------------------------------------------------------------------------